Specifying termination in CSP

Successful Termination in Timed CSP

In previous work the authors investigated the inconsistencies of how successful termination was modelled in Hoare, Brookes and Roscoe’s original CSP. This led to the definition of a variant of CSP, called CSPT . CSPT presents a solution to these problems by means of adding a termination axiom to the original process axioms. In this paper we investigate how successful process termination is mode...

Specifying Authentication Using Signal Events in CSP

The formal analysis of cryptographic protocols has developed into a comprehensive body of knowledge, building on a wide variety of formalisms and treating a diverse range of security properties, foremost of which is authentication. The formal specification of authentication has long been a subject of examination. In this paper, we discuss the use of correspondence to formally specify authentica...

Specifying Features in Requirements Using CSP-OZ

Specifying and Checking Java using CSP

Currently several approaches are done in applying formal techniques to the Java programming language. A new trend is to take dynamic behaviour into account when designing such techniques. To bring formal techniques to practical applications one often has to reduce the goal coming down from full verification to runtime checking. jassda [5,4] is a framework for performing such runtime checks at t...

Specifying Interactive Systems in Object-Z and CSP

In this paper we use a semantic integration of Object-Z and CSP to formally specify interactive systems. Interactive systems can be viewed as composed of functionality, presentation and interaction with diierent notations appropriate to each aspect. A model-based notation such as Object-Z can be used for deening functionality and presentation but a behaviour-based notation such as CSP is requir...